Description: 利用vc++实现的裁剪功能，可实现凹多边形、凸多边形的线裁剪-Using vc++ implementation of the clipping function can be realized concave polygon, convex polygon of the line cutting Platform: |
Size: 270336 |
Author:王伟伟 |
Hits:
Description: 学图形学的时候的小程序，可以对线段和多边形进行裁剪-School when a small graphics program can be carried out on the line and polygon clipping Platform: |
Size: 1957888 |
Author:王 |
Hits:
Description: 运用Sutherland-Hodgeman算法的多边形裁剪算法。C语言实现。-The use of the Sutherland-Hodgeman polygon clipping algorithm algorithm. C language. Platform: |
Size: 1024 |
Author:郑骥跃 |
Hits:
Description: 对于直线/多边形的裁剪实验，要求实现标准矩形窗口的裁剪，窗口边界由键盘输入或鼠标确定，直线/多边形都是任意的。裁剪后的图形要准确，不能多或者少点。-For the straight line/polygon clipping experiments required to achieve the standard rectangular window clipping, the window borders from the keyboard or mouse to determine a straight line/polygons are arbitrary. After cutting the graphics to be accurate, no more or less. Platform: |
Size: 1942528 |
Author:linym |
Hits:
Description: 对于直线/多边形的裁剪实验，要求实现标准矩形窗口的裁剪，窗口边界由键盘输入或鼠标确定，直线/多边形都是任意的。裁剪后的图形要准确，不能多或者少点。
要求掌握各自算法的基本原理和算法设计，画出算法实现的程序流程图，使用C或者VC++实现算法，并演示。
-For the straight line/polygon clipping experiments required to achieve the standard rectangular window clipping, the window borders from the keyboard or mouse to determine a straight line/polygons are arbitrary. After cutting the graphics to be accurate, no more or less. Required to master the basic principles of each algorithm and algorithm design, draw algorithm flow chart of procedures for the use of C or VC++ algorithm, and demonstrate. Platform: |
Size: 2118656 |
Author:linym |
Hits:
Description: An implementation of an Ear Clipping algorithm, used for triangulating geometry (i.e. making an arbitrary polygon in to triangles). Platform: |
Size: 256000 |
Author:Mike Kasprzak |
Hits:
Description: 图形裁剪，有点、线、多边形裁剪，点、线使用四比特法，多边形使用四边框裁剪-Graphic cutting, a little, line, polygon clipping, point, line and use the four-bit method, polygon clipping using the four border Platform: |
Size: 16384 |
Author:朱军 |
Hits:
Description: 自己做的图形学作业，多边形填充、裁剪。填充和裁剪都是多种方法实现-The graphics make their own operations, polygon filling, clipping. Filling and cutting are many ways to achieve the Platform: |
Size: 4118528 |
Author:黄松 |
Hits:
Description: opengl 多边形裁剪
三维视图
填充 画线 整合小插件-opengl polygon clipping drawing a line filled with three-dimensional view of a small plug-in integration Platform: |
Size: 4076544 |
Author:陈建 |
Hits:
Description: 计算机图形学的最基本的几个实验 包括三种画 直线的算法 画圆和椭圆 直线段的裁剪 多边形的裁剪-Several computer graphics most basic experiment includes three draw a straight line algorithms draw a circle and oval cutting straight line polygon clipping Platform: |
Size: 2060288 |
Author:鹿文杨 |
Hits:
Description: 在定义了窗口之后，我们只需将窗口内的图形显示出来，对于窗口之外的图形我们是不关心的。因此，必须将窗口外的图形裁剪下去。在本资料中，实现如下对直线段进行裁剪的算法：Cohen-Sutherland算法、中点分割算法、梁友栋-Barsky算法，并且利用Sutherland-Hodgman算法实现对多边形的裁剪，最后，实现当裁剪域是任意凸多边形时的裁剪算法。-In the definition of the window, we simply window graphics are displayed, in addition to window graphics we are not concerned. Therefore, the need to cut down the graphics outside the window. In this data, to achieve the following sections of the cut line algorithm: Cohen-Sutherland algorithm, the mid-point division algorithm, Liangyou Dong-Barsky algorithm, and using Sutherland-Hodgman polygon clipping algorithm, and finally, to achieve when the cutting domain is arbitrary when the convex polygon clipping algorithm. Platform: |
Size: 1958912 |
Author:秀 |
Hits:
Description: 在定义了窗口之后，我们只需将窗口内的图形显示出来，对于窗口之外的图形我们是不关心的。因此，必须将窗口外的图形裁剪下去。在本资料中，实现如下对直线段进行裁剪的算法：Cohen-Sutherland算法、中点分割算法、梁友栋-Barsky算法，并且利用Sutherland-Hodgman算法实现对多边形的裁剪，最后，实现当裁剪域是任意凸多边形时的裁剪算法。-In the definition of the window, we simply window graphics are displayed, in addition to window graphics we are not concerned. Therefore, the need to cut down the graphics outside the window. In this data, to achieve the following sections of the cut line algorithm: Cohen-Sutherland algorithm, the mid-point division algorithm, Liangyou Dong-Barsky algorithm, and using Sutherland-Hodgman polygon clipping algorithm, and finally, to achieve when the cutting domain is arbitrary when the convex polygon clipping algorithm. Platform: |
Size: 1959936 |
Author:秀 |
Hits:
Search - polygon clipping